A GENERALIZED CONVERGENCE RESULT FOR THE GRAPH-BASED ANT SYSTEM METAHEURISTIC
نویسندگان
چکیده
منابع مشابه
A Generalized Convergence Result for the Graph–Based Ant System Metaheuristic
It is shown that on fairly weak conditions, the current solutions of a metaheuristic following the ant colony optimization paradigm, the Graph–Based Ant System, converge with a probability that can be made arbitrarily close to unity to one element of the set of optimal solutions. The result generalizes a previous result by removing the very restrictive condition that both the optimal solution a...
متن کاملA Graph-based Ant System and its convergence
A general framework for solving combinatorial optimization problems heuristically by the Ant System approach is developed. The framework is based on the concept of a construction graph, a graph assigned to an instance of the optimization problem under consideration, encoding feasible solutions by walks. It is shown that under certain conditions, the solutions generated in each iteration of this...
متن کاملProduction–inventory scheduling using Ant System metaheuristic
The present paper presents the algorithmic solution, based on an Ant System metaheuristic, of an industrial production–inventory problem in a steel continuous-casting plant. The model proposed is based on an objective function, the aim of which is to find the most profitable production schedule of the steel billets. Furthermore, the model takes into account the relevant parameters of the finite...
متن کاملGraph Convergence for H(.,.)-co-Accretive Mapping with over-Relaxed Proximal Point Method for Solving a Generalized Variational Inclusion Problem
In this paper, we use the concept of graph convergence of H(.,.)-co-accretive mapping introduced by [R. Ahmad, M. Akram, M. Dilshad, Graph convergence for the H(.,.)-co-accretive mapping with an application, Bull. Malays. Math. Sci. Soc., doi: 10.1007/s40840-014-0103-z, 2014$] and define an over-relaxed proximal point method to obtain the solution of a generalized variational inclusion problem ...
متن کاملAn Ant System Algorithm For Graph Bisection
This paper gives an algorithm for the graph bisection problem using the Ant System (AS) technique. The ant algorithm given in this paper differs from the usual ant algorithms in that the individual ant in the system does not construct a solution to the problem nor a component of the solution directly. Rather the collective behavior of the two species of ants in the system induces a solution to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Probability in the Engineering and Informational Sciences
سال: 2003
ISSN: 0269-9648,1469-8951
DOI: 10.1017/s0269964803174086